Performance Evaluation of Homomorphic Encryption based Data Access Control
نویسندگان
چکیده
منابع مشابه
Hierarchical Role-Based Access Control with Homomorphic Encryption for Database as a Service
Database-as-a-service provides services for accessing and managing customers data which provides ease of access, and the cost is less for these services. There is a possibility that the DBaaS service provider may not be trusted, and data may be stored on a untrusted server. The access control mechanism can restrict users from unauthorized access, but in cloud environment access control policies...
متن کاملTargeted Homomorphic Attribute-Based Encryption
In (key-policy) attribute based encryption (ABE), messages are encrypted respective to attributes x, and keys are generated respective to policy functions f . The ciphertext is decryptable by a key only if f(x) = 0. Adding homomorphic capabilities to ABE is a long standing open problem, with current techniques only allowing compact homomorphic evaluation on ciphertext respective to the same x. ...
متن کاملHomomorphic Encryption Based Data Security on Federated Cloud Computing
Cloud computing usage has increased rapidly in both industries and in research. In recent days as the data grows rapidly, in order to meet the business needs federated cloud is adopted. In federated cloud, as the data is stored and processed away from the user and the cloud service provider, privacy and integrity of the data plays a crucial role. This paper proposes a practical and efficient me...
متن کاملQuantum Search on Encrypted Data Based on Quantum Homomorphic Encryption
Here we propose a quantum search protocols on ciphered superposition state based on quantum homomorphic encryption where a client Alice with limited quantum ability can deliver her encrypted quantum data to a powerful but untrusted quantum search server and let the server search for her without decryption. By outsourcing the key-updating and interaction work to a trusted key center, the client ...
متن کاملHomomorphic Encryption for Multiplications and Pairing Evaluation
We propose a generic approach to design homomorphic encryption schemes, which extends Gjøsteen’s framework. From this generic method, we deduce a new homomorphic encryption scheme in a composite-order subgroup of points of an elliptic curve which admits a pairing e : G ×G → Gt. This scheme has some interesting theoretical and practical properties: it allows an arbitrary number of multiplication...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2016
ISSN: 0975-8887
DOI: 10.5120/ijca2016908996